Forbidden subgraphs for chorded pancyclicity
نویسندگان
چکیده
منابع مشابه
Forbidden subgraphs for chorded pancyclicity
We call a graph G pancyclic if it contains at least one cycle of every possible length m, for 3 ≤ m ≤ |V (G)|. In this paper, we define a new property called chorded pancyclicity. We explore forbidden subgraphs in claw-free graphs sufficient to imply that the graph contains at least one chorded cycle of every possible length 4, 5, . . . , |V (G)|. In particular, certain paths and triangles with...
متن کاملForbidden Subgraphs and Pancyclicity
We prove that every 2{connected K 1;3-free and Z 3 ?free graph is hamiltonian except for two graphs. Furthermore, we give a complete characterization of all 2?connected, K 1;3-free graphs, which are not pancyclic, and which are Z 3-free, B-free, W-free, or HP 7 ?free.
متن کاملForbidden Subgraphs and (k,m)-pancyclicity
A graph G on n vertices is said to be (k, m)-pancyclic if each k-set S ⊆ V (G) is contained in cycles of each of the following lengths: m,m + 1, · · · , n. This property generalizes vertex pancyclicity. There are ten pairs of forbidden subgraphs which guarantee that a 2-connected graph is (k,m)-pancyclic for some integer m ≤ n. We give the best (smallest) possible value for m in each of these t...
متن کاملPancyclicity of 3-connected graphs: Pairs of forbidden subgraphs
We characterize all pairs of connected graphs {X,Y } such that each 3-connected {X,Y }-free graph is pancyclic. In particular, we show that if each of the graphs in such a pair {X,Y } has at least four vertices, then one of them is the claw K1,3, while the other is a subgraph of one of six specified graphs.
متن کاملStability for large forbidden subgraphs
We strengthen the stability theorem of Erdős and Simonovits. Write Kr (s1, . . . , sr) for the complete r-partite graph with parts of size s1, . . . , sr and Tr (n) for the r-partite Turán graph of order n. Our main result is: For all r ≥ 2 and sufficiently small c > 0, ε > 0, for every graph G of order n with ⌈ (1− 1/r − ε)n2/2 ⌉ edges, one of the following conditions holds: (a) Kr+1 ( ⌊c lnn⌋...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.07.027